On Boas-type Problem
نویسنده
چکیده
R.P. Boas has found necessary and sufficient conditions of belonging of function to Lipschitz class. From his findings it turned out, that the conditions on sine and cosine coefficients for belonging of function to Lip α (0 < α < 1) are the same, but for Lip 1 are different. Later his results were generalized by many authors in the viewpoint of generalization of condition on the majorant of modulus of continuity. The aim of this paper is to obtain Boas-type theorems for generalized Lipschitz classes. To define generalized Lipschitz classes we use the concept of modulus of smoothness of fractional order.
منابع مشابه
An Improved O ( R log log n + n ) Time Algorithm for Computing the Longest Common Subsequence
In this paper, we revisit the much studied LCS problem for two given sequences. Based on the algorithm of Iliopoulos and Rahman for solving the LCS problem, we have suggested 3 new improved algorithms. We first reformulate the problem in a very succinct form. The problem LCS is abstracted to an abstract data type DS on an ordered positive integer set with a special operation Update(S, x). For t...
متن کاملA Robust Kernel-Based Solution to Control-Hijacking Buffer Overflow Attacks
In this paper, we propose a robust kernel-based solution, called AURORA, to a ubiquitous security problem – control-hijacking Buffer Overflow Attacks (BOAs). AURORA utilizes either the addresses of the buffers storing input strings or signatures to detect and block control-hijacking BOA strings in the kernel, including zero-day ones. Although AURORA detects some types of BOAs through signatures...
متن کاملCharacterisation of Brachycephalic Obstructive Airway Syndrome in French Bulldogs Using Whole-Body Barometric Plethysmography
Brachycephalic obstructive airway syndrome (BOAS) is an important health and welfare problem in several popular dog breeds. Whole-body barometric plethysmography (WBBP) is a non-invasive method that allows safe and repeated quantitative measurements of respiratory cycles on unsedated dogs. Here respiratory flow traces in French bulldogs from the pet population were characterised using WBBP, and...
متن کاملA Practical O(Rlog log n+n) time Algorithm for Computing the Longest Common Subsequence
In this paper, we revisit the much studied LCS problem for two given sequences. Based on the algorithm of Iliopoulos and Rahman for solving the LCS problem, we have suggested 3 new improved algorithms. We first reformulate the problem in a very succinct form. The problem LCS is abstracted to an abstract data type DS on an ordered positive integer set with a special operation Update(S,x). For th...
متن کاملCarathéodory-Fejér type extremal problems on locally compact Abelian groups
We consider the extremal problem of maximizing a point value | f (z) | at a given point z ∈ G by some positive definite and continuous function f on a locally compact Abelian group (LCA group) G, where for a given symmetric open set Ω ∋ z, f vanishes outside Ω and is normalized by f (0) = 1. This extremal problem was investigated in R and Rd and for Ω a 0-symmetric convex body in a paper of Boa...
متن کامل